By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

A Formal Theory of Consensus

J. P. Barthélemy and M. F. Janowitz

pp. 305-322

A New Approach to the Server Problem

Mark Chrobak and Lawerence L. Larmore

pp. 323-328

Midpoints of Diagonals of Convex $n$-Gons

Paul Erdös, Peter Fishburn, and Zoltan Füred

pp. 329-341

NC Algorithms for Recognizing Partial 2-Trees and 3-Trees

Daniel Granot and Darko Skorin-Kapov

pp. 342-354

Rigidity Matroids

Jack E. Graver

pp. 355-368

Dynamic Steiner Tree Problem

Makoto Imase and Bernard M. Waxman

pp. 369-384

Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images

Sung Kwon Kim

pp. 385-396

On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs

Gary MacGillivray

pp. 397-408

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring

Moni Naor

pp. 409-412

Generating the Linear Extensions of Certain Posets by Transpositions

Gara Pruesse and Frank Ruskey

pp. 413-422

On the Power of Threshold Circuits with Small Weights

Kai-Yeung Siu and Jehoshua Bruck

pp. 423-435

On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice

Shmuel Onn

pp. 436-447

A Note on Planar Graphs and Circle Orders

Edward R. Scheinerman

pp. 448-451